An FPTAS for Flows over Time with Aggregate Arc Capacities

نویسندگان

  • Daniel Dressler
  • Martin Skutella
چکیده

We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dependent flow rate that must always be bounded by the arc’s capacity. Only recently, Melkonian introduced an alternative model where so-called bridge capacities bound the total amount of flow traveling along an arc, at any point of time. The contribution of this paper is twofold. Firstly, we introduce a common generalization of both the classical flow over time model and Melkonian’s model. Secondly, we present a non-trivial extension of an FPTAS by Fleischer and Skutella to our new flow model. Prior to this, no approximation algorithm was known for Melkonian’s model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times1

Given a network with capacities and transit times on the arcs, the quickest flow problem asks for a “flow over time” that satisfies given demands within minimal time. In the setting of flows over time, flow on arcs may vary over time and the transit time of an arc is the time it takes for flow to travel through this arc. In most real-world applications (such as, e.g., road traffic, communicatio...

متن کامل

Capacitated Confluent Flows: Complexity and Algorithms

A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We study the Maximum Confluent Flow Problem (MaxConf) with a single commodity but multiple sources and sinks. Unlike previous results, we consider heterogeneous arc capacities. The supplies and demands of the sources and sin...

متن کامل

An approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine

This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...

متن کامل

Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems

flows over time: A first step towards solving dynamic packing problems Jan-Philipp W. Kappmeier, Jannik Matuschke, and Britta Peis TU Berlin, Institut für Mathematik, Straße des 17. Juni 136, 10623 Berlin, Germany {kappmeier,matuschke,peis}@math.tu-berlin.de Preprint 001-2012 (revised version) November 12, 2012 Abstract. Flows over time [4] generalize classical network flows by introducing a no...

متن کامل

Approximating Earliest Arrival Flows with Flow-Dependent Transit Times

For the earliest arrival flow problem one is given a network G = (V,A) with capacities u(a) and transit times τ(a) on its arcs a ∈ A, together with a source and a sink vertex s, t ∈ V . The objective is to send flow from s to t that moves through the network over time, such that for each point in time θ ∈ [0, T ) the maximum possible amount of flow reaches t. If, for each θ ∈ [0, T ) this flow ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010